TSTP Solution File: SET200^5 by cvc5---1.0.5
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : cvc5---1.0.5
% Problem : SET200^5 : TPTP v8.1.2. Released v4.0.0.
% Transfm : none
% Format : tptp
% Command : do_cvc5 %s %d
% Computer : n007.cluster.edu
% Model : x86_64 x86_64
% CPU : Intel(R) Xeon(R) CPU E5-2620 v4 2.10GHz
% Memory : 8042.1875MB
% OS : Linux 3.10.0-693.el7.x86_64
% CPULimit : 300s
% WCLimit : 300s
% DateTime : Thu Aug 31 14:38:12 EDT 2023
% Result : Theorem 0.20s 0.51s
% Output : Proof 0.20s
% Verified :
% SZS Type : -
% Comments :
%------------------------------------------------------------------------------
%----WARNING: Could not form TPTP format derivation
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.10/0.12 % Problem : SET200^5 : TPTP v8.1.2. Released v4.0.0.
% 0.10/0.13 % Command : do_cvc5 %s %d
% 0.13/0.34 % Computer : n007.cluster.edu
% 0.13/0.34 % Model : x86_64 x86_64
% 0.13/0.34 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.13/0.34 % Memory : 8042.1875MB
% 0.13/0.34 % OS : Linux 3.10.0-693.el7.x86_64
% 0.13/0.34 % CPULimit : 300
% 0.13/0.34 % WCLimit : 300
% 0.13/0.34 % DateTime : Sat Aug 26 11:52:26 EDT 2023
% 0.13/0.34 % CPUTime :
% 0.20/0.47 %----Proving TH0
% 0.20/0.51 %------------------------------------------------------------------------------
% 0.20/0.51 % File : SET200^5 : TPTP v8.1.2. Released v4.0.0.
% 0.20/0.51 % Domain : Set Theory
% 0.20/0.51 % Problem : TPS problem BOOL-PROP-34
% 0.20/0.51 % Version : Especial.
% 0.20/0.51 % English : Trybulec's 34th Boolean property of sets
% 0.20/0.51
% 0.20/0.51 % Refs : [TS89] Trybulec & Swieczkowska (1989), Boolean Properties of
% 0.20/0.51 % : [Bro09] Brown (2009), Email to Geoff Sutcliffe
% 0.20/0.51 % Source : [Bro09]
% 0.20/0.51 % Names : tps_0154 [Bro09]
% 0.20/0.51 % : BOOL-PROP-34 [TPS]
% 0.20/0.51
% 0.20/0.51 % Status : Theorem
% 0.20/0.51 % Rating : 0.00 v5.3.0, 0.25 v5.2.0, 0.00 v4.0.0
% 0.20/0.51 % Syntax : Number of formulae : 2 ( 0 unt; 1 typ; 0 def)
% 0.20/0.51 % Number of atoms : 0 ( 0 equ; 0 cnn)
% 0.20/0.51 % Maximal formula atoms : 0 ( 0 avg)
% 0.20/0.51 % Number of connectives : 15 ( 0 ~; 2 |; 1 &; 8 @)
% 0.20/0.51 % ( 0 <=>; 4 =>; 0 <=; 0 <~>)
% 0.20/0.51 % Maximal formula depth : 10 ( 10 avg)
% 0.20/0.51 % Number of types : 2 ( 1 usr)
% 0.20/0.51 % Number of type conns : 4 ( 4 >; 0 *; 0 +; 0 <<)
% 0.20/0.51 % Number of symbols : 0 ( 0 usr; 0 con; --- aty)
% 0.20/0.51 % Number of variables : 7 ( 0 ^; 7 !; 0 ?; 7 :)
% 0.20/0.51 % SPC : TH0_THM_NEQ_NAR
% 0.20/0.51
% 0.20/0.51 % Comments : This problem is from the TPS library. Copyright (c) 2009 The TPS
% 0.20/0.51 % project in the Department of Mathematical Sciences at Carnegie
% 0.20/0.51 % Mellon University. Distributed under the Creative Commons copyleft
% 0.20/0.51 % license: http://creativecommons.org/licenses/by-sa/3.0/
% 0.20/0.51 % : Polymorphic definitions expanded.
% 0.20/0.51 % :
% 0.20/0.51 %------------------------------------------------------------------------------
% 0.20/0.51 thf(a_type,type,
% 0.20/0.51 a: $tType ).
% 0.20/0.51
% 0.20/0.51 thf(cBOOL_PROP_34_pme,conjecture,
% 0.20/0.51 ! [X: a > $o,Y: a > $o,Z: a > $o,V: a > $o] :
% 0.20/0.51 ( ( ! [Xx: a] :
% 0.20/0.51 ( ( X @ Xx )
% 0.20/0.51 => ( Y @ Xx ) )
% 0.20/0.51 & ! [Xx: a] :
% 0.20/0.51 ( ( Z @ Xx )
% 0.20/0.51 => ( V @ Xx ) ) )
% 0.20/0.51 => ! [Xx: a] :
% 0.20/0.51 ( ( ( X @ Xx )
% 0.20/0.51 | ( Z @ Xx ) )
% 0.20/0.51 => ( ( Y @ Xx )
% 0.20/0.51 | ( V @ Xx ) ) ) ) ).
% 0.20/0.51
% 0.20/0.51 %------------------------------------------------------------------------------
% 0.20/0.51 ------- convert to smt2 : /export/starexec/sandbox/tmp/tmp.BHpIPqL5Fc/cvc5---1.0.5_3252.p...
% 0.20/0.51 (declare-sort $$unsorted 0)
% 0.20/0.51 (declare-sort tptp.a 0)
% 0.20/0.51 (assert (not (forall ((X (-> tptp.a Bool)) (Y (-> tptp.a Bool)) (Z (-> tptp.a Bool)) (V (-> tptp.a Bool))) (=> (and (forall ((Xx tptp.a)) (=> (@ X Xx) (@ Y Xx))) (forall ((Xx tptp.a)) (=> (@ Z Xx) (@ V Xx)))) (forall ((Xx tptp.a)) (=> (or (@ X Xx) (@ Z Xx)) (or (@ Y Xx) (@ V Xx))))))))
% 0.20/0.51 (set-info :filename cvc5---1.0.5_3252)
% 0.20/0.51 (check-sat-assuming ( true ))
% 0.20/0.51 ------- get file name : TPTP file name is SET200^5
% 0.20/0.51 ------- cvc5-thf : /export/starexec/sandbox/solver/bin/cvc5---1.0.5_3252.smt2...
% 0.20/0.51 --- Run --ho-elim --full-saturate-quant at 10...
% 0.20/0.51 % SZS status Theorem for SET200^5
% 0.20/0.51 % SZS output start Proof for SET200^5
% 0.20/0.51 (
% 0.20/0.51 (let ((_let_1 (not (forall ((X (-> tptp.a Bool)) (Y (-> tptp.a Bool)) (Z (-> tptp.a Bool)) (V (-> tptp.a Bool))) (=> (and (forall ((Xx tptp.a)) (=> (@ X Xx) (@ Y Xx))) (forall ((Xx tptp.a)) (=> (@ Z Xx) (@ V Xx)))) (forall ((Xx tptp.a)) (=> (or (@ X Xx) (@ Z Xx)) (or (@ Y Xx) (@ V Xx))))))))) (let ((_let_2 (forall ((Xx tptp.a)) (or (not (ho_2 SKOLEM_FUN_QUANTIFIERS_SKOLEMIZE_5 Xx)) (ho_2 SKOLEM_FUN_QUANTIFIERS_SKOLEMIZE_6 Xx))))) (let ((_let_3 (ho_2 SKOLEM_FUN_QUANTIFIERS_SKOLEMIZE_6 SKOLEM_FUN_QUANTIFIERS_SKOLEMIZE_7))) (let ((_let_4 (ho_2 SKOLEM_FUN_QUANTIFIERS_SKOLEMIZE_5 SKOLEM_FUN_QUANTIFIERS_SKOLEMIZE_7))) (let ((_let_5 (not _let_4))) (let ((_let_6 (or _let_5 _let_3))) (let ((_let_7 (ho_2 SKOLEM_FUN_QUANTIFIERS_SKOLEMIZE_4 SKOLEM_FUN_QUANTIFIERS_SKOLEMIZE_7))) (let ((_let_8 (ho_2 SKOLEM_FUN_QUANTIFIERS_SKOLEMIZE_3 SKOLEM_FUN_QUANTIFIERS_SKOLEMIZE_7))) (let ((_let_9 (not _let_8))) (let ((_let_10 (and _let_9 _let_5))) (let ((_let_11 (not _let_2))) (let ((_let_12 (forall ((Xx tptp.a)) (or (not (ho_2 SKOLEM_FUN_QUANTIFIERS_SKOLEMIZE_3 Xx)) (ho_2 SKOLEM_FUN_QUANTIFIERS_SKOLEMIZE_4 Xx))))) (let ((_let_13 (not _let_12))) (let ((_let_14 (or _let_13 _let_11 _let_10 _let_7 _let_3))) (let ((_let_15 (forall ((BOUND_VARIABLE_653 |u_(-> tptp.a Bool)|) (BOUND_VARIABLE_648 |u_(-> tptp.a Bool)|) (BOUND_VARIABLE_650 |u_(-> tptp.a Bool)|) (BOUND_VARIABLE_644 |u_(-> tptp.a Bool)|) (BOUND_VARIABLE_627 tptp.a)) (or (not (forall ((Xx tptp.a)) (or (not (ho_2 BOUND_VARIABLE_653 Xx)) (ho_2 BOUND_VARIABLE_648 Xx)))) (not (forall ((Xx tptp.a)) (or (not (ho_2 BOUND_VARIABLE_650 Xx)) (ho_2 BOUND_VARIABLE_644 Xx)))) (and (not (ho_2 BOUND_VARIABLE_653 BOUND_VARIABLE_627)) (not (ho_2 BOUND_VARIABLE_650 BOUND_VARIABLE_627))) (ho_2 BOUND_VARIABLE_648 BOUND_VARIABLE_627) (ho_2 BOUND_VARIABLE_644 BOUND_VARIABLE_627))))) (let ((_let_16 (not _let_14))) (let ((_let_17 (forall ((u |u_(-> tptp.a Bool)|) (e Bool) (i tptp.a)) (not (forall ((v |u_(-> tptp.a Bool)|)) (not (forall ((ii tptp.a)) (= (ho_2 v ii) (ite (= i ii) e (ho_2 u ii)))))))))) (let ((_let_18 (forall ((x |u_(-> tptp.a Bool)|) (y |u_(-> tptp.a Bool)|)) (or (not (forall ((z tptp.a)) (= (ho_2 x z) (ho_2 y z)))) (= x y))))) (let ((_let_19 (not _let_15))) (let ((_let_20 (EQ_RESOLVE (ASSUME :args (_let_1)) (TRANS (MACRO_SR_EQ_INTRO :args (_let_1 SB_DEFAULT SBA_FIXPOINT)) (PREPROCESS :args ((= (not (forall ((X (-> tptp.a Bool)) (Y (-> tptp.a Bool)) (Z (-> tptp.a Bool)) (V (-> tptp.a Bool)) (BOUND_VARIABLE_627 tptp.a)) (or (not (forall ((Xx tptp.a)) (or (not (@ X Xx)) (@ Y Xx)))) (not (forall ((Xx tptp.a)) (or (not (@ Z Xx)) (@ V Xx)))) (and (not (@ X BOUND_VARIABLE_627)) (not (@ Z BOUND_VARIABLE_627))) (@ Y BOUND_VARIABLE_627) (@ V BOUND_VARIABLE_627)))) _let_19))))))) (let ((_let_21 (or))) (let ((_let_22 (MACRO_RESOLUTION_TRUST (EQ_RESOLVE (IMPLIES_ELIM (SCOPE (SKOLEMIZE _let_20) :args (_let_19))) (CONG (MACRO_SR_PRED_INTRO :args ((= (not _let_19) _let_15))) (REFL :args (_let_16)) :args _let_21)) (AND_ELIM (MACRO_SR_PRED_TRANSFORM (AND_INTRO _let_20 (PREPROCESS :args ((and _let_18 _let_17)))) :args ((and _let_19 _let_18 _let_17))) :args (0)) :args (_let_16 true _let_15)))) (let ((_let_23 (REFL :args (_let_14)))) (let ((_let_24 (not _let_6))) (let ((_let_25 (or _let_9 _let_7))) (let ((_let_26 (_let_12))) (let ((_let_27 (SKOLEM_FUN_QUANTIFIERS_SKOLEMIZE_7 QUANTIFIERS_INST_CBQI_CONFLICT))) (let ((_let_28 (_let_10))) (let ((_let_29 (_let_2))) (SCOPE (SCOPE (MACRO_RESOLUTION_TRUST (IMPLIES_ELIM (SCOPE (INSTANTIATE (ASSUME :args _let_29) :args _let_27) :args _let_29)) (MACRO_RESOLUTION_TRUST (REORDERING (CNF_OR_POS :args (_let_6)) :args ((or _let_5 _let_3 _let_24))) (MACRO_RESOLUTION_TRUST (REORDERING (EQ_RESOLVE (CNF_AND_NEG :args _let_28) (CONG (REFL :args _let_28) (MACRO_SR_PRED_INTRO :args ((= (not _let_9) _let_8))) (MACRO_SR_PRED_INTRO :args ((= (not _let_5) _let_4))) :args _let_21)) :args ((or _let_8 _let_4 _let_10))) (MACRO_RESOLUTION_TRUST (REORDERING (CNF_OR_POS :args (_let_25)) :args ((or _let_9 _let_7 (not _let_25)))) (MACRO_RESOLUTION_TRUST (CNF_OR_NEG :args (_let_14 3)) _let_22 :args ((not _let_7) true _let_14)) (MACRO_RESOLUTION_TRUST (IMPLIES_ELIM (SCOPE (INSTANTIATE (ASSUME :args _let_26) :args _let_27) :args _let_26)) (MACRO_RESOLUTION_TRUST (REORDERING (EQ_RESOLVE (CNF_OR_NEG :args (_let_14 0)) (CONG _let_23 (MACRO_SR_PRED_INTRO :args ((= (not _let_13) _let_12))) :args _let_21)) :args ((or _let_12 _let_14))) _let_22 :args (_let_12 true _let_14)) :args (_let_25 false _let_12)) :args (_let_9 true _let_7 false _let_25)) (MACRO_RESOLUTION_TRUST (CNF_OR_NEG :args (_let_14 2)) _let_22 :args ((not _let_10) true _let_14)) :args (_let_4 true _let_8 true _let_10)) (MACRO_RESOLUTION_TRUST (CNF_OR_NEG :args (_let_14 4)) _let_22 :args ((not _let_3) true _let_14)) :args (_let_24 false _let_4 true _let_3)) (MACRO_RESOLUTION_TRUST (REORDERING (EQ_RESOLVE (CNF_OR_NEG :args (_let_14 1)) (CONG _let_23 (MACRO_SR_PRED_INTRO :args ((= (not _let_11) _let_2))) :args _let_21)) :args ((or _let_2 _let_14))) _let_22 :args (_let_2 true _let_14)) :args (false true _let_6 false _let_2)) :args (_let_1 true))))))))))))))))))))))))))))))))
% 0.20/0.51 )
% 0.20/0.51 % SZS output end Proof for SET200^5
% 0.20/0.52 % cvc5---1.0.5 exiting
% 0.20/0.52 % cvc5---1.0.5 exiting
%------------------------------------------------------------------------------